The Propositional Mu-Calculus is Elementary
نویسندگان
چکیده
ACKNOWLEDGEMENT: The work of t h e second a u t h o r was supported i n p a r t by NSF g r a n t MCS-830287G.
منابع مشابه
An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus
The propositional mu-calculus is a propositional logic of programs which incorporates a least fixpoint operator and subsumes the propositional dynamic logic of Fischer and Ladner, the infinite looping construct of Streett, and the game logic of Parikh. We give an elementary time decision procedure, using a reduction to the emptiness problem for automata on infinite trees. A small model theorem ...
متن کاملOrder theoretic Correspondence theory for Intuitionistic mu-calculus
Sahlqvist correspondence theory [3], [4] is one of the most important and useful results of classical modal logic. It gives a syntactic identification of a class of modal formulas whose associated normal modal logics are strongly complete with respect to elementary (i.e. first-order definable) classes of frames. Every Sahlqvist formula is both canonical and corresponds to some elementary frame ...
متن کاملTree Automata, Mu-calculus and Determinacy
We show that the propositional Mu-Calculus is equivalent in expressive p o wer to nite automata on inn-nite trees. Since complementation is trivial in the Mu-Calculus, our equivalence provides a radically sim-pliied, alternative proof of Rabin's complementation lemma for tree automata, which is the heart of one of the deepest decidability results. We also show h o w Mu-Calculus can be used to e...
متن کاملProgram Schemata vs. Automata for Decidability of Program Logics
A new technique for decidability of program logics is introduced. This technique is applied to the most expressive propositional program logic Mu-Calculus.
متن کاملCompleteness of Kozen's Axiomatisation of the Propositional mu-Calculus
Propositional μ-calculus is an extension of the propositional modal logic with the least fixpoint operator. In the paper introducing the logic Kozen posed a question about completeness of the axiomatisation which is a small extension of the axiomatisation of the modal system K. It is shown that this axiomatisation is complete.
متن کامل